Block distribution in random strings
نویسندگان
چکیده
منابع مشابه
Power from Random Strings
We show that sets consisting of strings of high Kolmogorov complexity provide examples of sets that are complete for several complexity classes under probabilistic and non-uniform reductions. These sets are provably not complete under the usual many-one reductions. Let RC, RKt, RKS, RKT be the sets of strings x having complexity at least |x|/2, according to the usual Kolmogorov complexity measu...
متن کاملOn Computation and Random Strings
2 Preliminaries 2 2.1 Strings and Languages . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Turing Machines . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Recognizers and Deciders . . . . . . . . . . . . . . . . . . . . . . 4 2.4 Alternation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.5 Complexity Classes . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملRandom Strings Make Hard Instances
We establish the truth of the \instance complexity conjecture" in the case of DEXT-complete sets w.r.t. polynomial time computations, and r.e. complete sets w.r.t. recursive computations. Speciically, we obtain for every DEXT-complete set A an exponentially dense subset C such that for every nondecreasing polynomial t(n) = !(n log n), ic t (x : A) K t (x) ? c holds for some constant c and all x...
متن کاملOn Generating Independent Random Strings
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strings that are random and pairwise independent. If the two initial strings are random, then the above task can be performed in polynomial time. It is also possible to construct in polynomial time a random string, from two...
متن کاملT-duality invariance in random lattice strings.
Preserving the T-duality invariance of the continuum string in its random lattice regularization uniquely determines the random matrix model potential. For D=0 the duality transformation can be performed explicitly on the matrix action, and replaces color with flavor; invariance thus requires that the color and flavor groups be the same. 1 Internet address: [email protected].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 1993
ISSN: 0373-0956
DOI: 10.5802/aif.1345